Parallel FETI‐DP algorithm for efficient simulation of large‐scale EM problems
نویسندگان
چکیده
منابع مشابه
Efficient Parallel Algorithm for Direct Numerical Simulation of Turbulent Flows
A distributed algorithm for a high-order-accurate finite-difference approach to the direct numerical simulation (DNS) of transition and turbulence in compressible flows is described. This work has two major objectives. The first objective is to demonstrate that parallel and distributed-memory machines can be successfully and efficiently used to solve computationally intensive and input/output i...
متن کاملAn Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems
In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...
متن کاملAn Efficient Parallel Algorithm for Linear Programming Problems
This study developed a parallel algorithm to efficiently solve linear programming models. The proposed algorithm utilizes the Dantzig-Wolfe Decomposition Principle and can be easily implemented in a general distributed computing environment. The analytical performance of the new algorithm, including the speedup upper bound and lower bound limits, was derived. Numerical experiments are also prov...
متن کاملThe Parallel Problems Server : A Client - Server Model for Interactive LargeScale
Applying fast scientiic computing algorithms to large problems presents a diicult engineering problem. We describe a novel architecture for addressing this problem that uses a robust client-server model for interactive large-scale linear algebra computation. We discuss competing approaches and demonstrate the relative strengths of our approach. By way of example, we describe MITMatlab, a powerf...
متن کاملEfficient Parallel Feature Selection for Steganography Problems
The steganography problem consists of the identification of images hiding a secret message, which cannot be seen by visual inspection. This problem is nowadays becoming more and more important since the World Wide Web contains a large amount of images, which may be carrying a secret message. Therefore, the task is to design a classifier, which is able to separate the genuine images from the non...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Numerical Modelling: Electronic Networks, Devices and Fields
سال: 2016
ISSN: 0894-3370,1099-1204
DOI: 10.1002/jnm.2153